Generalizing substitution
نویسنده
چکیده
It is well known that, given an endofunctor H on a category C, the initial (A+H−)-algebras (if existing), i.e., the algebras of (wellfounded) H-terms over different variable supplies A, give rise to a monad with substitution as the extension operation (the free monad induced by the functor H). Moss [17] and Aczel, Adámek, Milius and Velebil [2] have shown that a similar monad, which even enjoys the additional special property of having iterations for all guarded substitution rules (complete iterativeness), arises from the inverses of the final (A+H−)-coalgebras (if existing), i.e., the algebras of non-wellfounded H-terms. We show that, upon an appropriate generalization of the notion of substitution, the same can more generally be said about the initial T ′(A,−)-algebras resp. the inverses of the final T ′(A,−)coalgebras for any endobifunctor T ′ on any category C such that the functors T ′(−, X) uniformly carry a monad structure. Résumé. ... 1991 Mathematics Subject Classification. 08B20, 18C15, 18C50.
منابع مشابه
Snakes and Caterpillars in Graceful Graphs
Graceful labelings use a prominent place among difference vertex labelings. In this work we present new families of graceful graphs all of them obtained applying a general substitution result. This substitution is applied here to replace some paths with some trees with a more complex structures. Two caterpillars with the same size are said to be textit{analogous} if thelarger stable sets, in bo...
متن کاملP75: A Study of Perfectionism, Anxiety Sensitivity and Sleep Disturbance in the Generalizing Anxiety Disorder and Normal People
Perfectionism, anxiety sensitivity and sleep disturbance are among the main causes of generalizing anxiety disorder. This study aims to compare perfectionism, anxiety sensitivity and sleep disturbance between patients with generalizing anxiety disorder (GAD) and control group. The present study was a cross-sectional and ex-post facto investigation (causal comparative method). Statistical univer...
متن کاملExplicit Cyclic Substitutions
In this paper we consider rewrite systems that describe the-calculus enriched with recursive and non-recursive local deenitions by generalizing thèexplicit substitutions' used by Abadi, Cardelli, Curien, and L evy 1] to describe sharing in-terms. This leads tòexplicit cyclic substitutions' that can describe the mutual sharing of local recursive deenitions. We demonstrate how this may be used to...
متن کاملFailure to respond as a problem in generalizing the results of research projects
This article has no abstract.
متن کاملSynchronous Grammars as Tree Transducers
Tree transducer formalisms were developed in the formal language theory community as generalizations of finite-state transducers from strings to trees. Independently, synchronous tree-substitution and -adjoining grammars arose in the computational linguistics community as a means to augment strictly syntactic formalisms to provide for parallel semantics. We present the first synthesis of these ...
متن کامل